Combinatorial Auctions Without Money

Truthful Combinatorial Assignment without Money

Mechanism design with agents who do not have quasi-linear preferences is an important line of research in social choice theory. Finding domains which admit truthful mechanisms is of central importance, particularly due to the well known impossibility result by Gibbard and Satterthwaite. In this paper we introduce a general framework for combinatorial assignments without money but with public va...

Combinatorial Auctions: A Survey

Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes and furniture. Because of complementarities (or substitution effects) between the different assets, bidders have preferences not just for particular items but for sets or bundles of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles or co...

Experiments on Combinatorial Auctions

This paper contains the description of experiments done so far in the combinatorial auction scenario. We describe the computee side and the society side. In this context we introduce also external objects providing services to the computees themselves, and in particular implementing a complex optimization algorithm. Experimental results are given for a traditional combinatorial auction and for ...

Iterative Combinatorial Auctions

Efficient Iterative Combinatorial Auctions

This survey considers the following setting. A seller wants to sell a set of indivisible goods. A set of buyers are interested in buying the goods. Buyers have private values for bundles of goods they are interested in buying. The seller’s objective is to allocate the goods to the buyers efficiently (maximizing the total utility of buyers). Since the values of buyers are private information, th...